Implementation of Integer Square Root
نویسندگان
چکیده
Square root plays a major role in applications like computer graphics, image processing. To increase the performance of computation, many algorithms have been proposed to carry out the computation task in hardware instead of software. One very common and relatively quick method for finding the square root of a number is the Newton-Raphson method which requires extensive use of division to produce results and its implementation on hardware is difficult as it requires large area. In this paper we implemented Integer square root by using square and compare, successive subtraction of odd integer’s and modified non-restoring methods. The three methods are implemented using Verilog HDL and Xilinx12.1. The results show that modified non-restoring method has less delay and area.
منابع مشابه
Non-Restoring Integer Square Root: A Case Study in Design by Principled Optimization
Theorem proving techniques are particularly well suited for reasoning about arithmetic above the bit level and for relating di erent levels of abstraction. In this paper we show how a non-restoring integer square root algorithm can be transformed to a very e cient hardware implementation. The top level is a Standard ML function that operates on unbounded integers. The bottom level is a structur...
متن کاملBacktracking Based Integer Factorisation, Primality Testing and Square Root Calculation
Breaking a big integer into two factors is a famous problem in the field of Mathematics and Cryptography for years. Many crypto-systems use such a big number as their key or part of a key with the assumption it is too big that the fastest factorisation algorithms running on the fastest computers would take impractically long period of time to factorise. Hence, many efforts have been provided to...
متن کاملA Non-trigonometric, Pseudo Area Preserving, Polyline Smoothing Algorithm
A line-smoothing algorithm based on simple arithmetic is presented and its characteristics are analyzed for various implementations. The algorithm is efficient because it can be implemented using only simple integer arithmetic, with no square root or trigonometric calculations. The algorithm is applicable to graph drawing applications that require smooth polylines between graph nodes. Though th...
متن کاملA lower bound for the root separation of polynomials
An experimental study by Collins (JSC; 2001) suggested the conjecture that the minimum separation of real zeros of irreducible integer polynomials is about the square root of Mahler’s bound for general integer polynomials. We prove that a power of about two thirds of the Mahler bound is already a lower bound for the minimum root separation of all integer polynomials.
متن کاملUnivariate Polynomial Real Root Isolation: Continued Fractions Revisited
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algebraic numbers. One motivation is to explain the method’s good performance in practice. We improve the previously known bound by a factor of dτ , where d is the polynomial degree and τ bounds the coefficient bitsize, thu...
متن کامل